A sequentially computable function that is not effectively continuous at any point
نویسندگان
چکیده
منابع مشابه
Computable real function F such that F is not polynomial time computable on [0, 1]
A computable real function F on [0,1] is constructed such that there exists an exponential time algorithm for the evaluation of the function on [0,1] on Turing machine but there does not exist any polynomial time algorithm for the evaluation of the function on [0,1] on Turing machine (moreover, it holds for any rational point on (0,1))
متن کاملTeaching Scientific Ethics Effectively at Any Level
247 Volume 15, Number 2 a central role in science but also that science influences ethics. The book can be used as a guide for scientists to make good judgments about what is acceptable and not acceptable in science. It can also help scientists determine how they want to see their discipline develop in the future in light of scientific discoveries and technological advancements in an increasing...
متن کاملAcademic nepotism – all that glitters is not gold
Dear Editor With increasing emphasis on publications forfaculty recruitment, career advancementand obtaining research grants, the issues relatedto author kinship and academic nepotism havegrown significantly and these probably reflectthe inflationary growth rather than the optimalgrowth warranted due to increasing researchcomplexity. Allesina S (1) measured the fullmagnitude of nepotism in the ...
متن کاملA Data Model for Effectively Computable Functions
Searching for a better data model would continue unless a satisfaction was reached. Improving the productivity and quality of developing traditional and emerging database applications is the motivation driving the research activities. This abstract is to introduce the approach of a data model EP data model. Its data structure is able to store as a finite set of nodes arbitrary effectively compu...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: Journal of Complexity
سال: 2006
ISSN: 0885-064X
DOI: 10.1016/j.jco.2006.05.004